Search results for "theory [gamma rays]"

A multi-step finite-state automaton for arbitrarily deterministic Tsetlin Machine learning

2021

The Development of Students’ Metacognitive Competences. A Case Study

2010

In the information society metacognitive competencies are essential. Based on some activities from the Enrichment Instrumental Program elaborated by professor Reuven Feuerstein we have designed a program for developing the students capacities of selfcontrol, selfknowing and intelectual learning strategies. The case study presents the formation of students’ metacognitive competences at the "Lucian Blaga" University of Sibiu, "Hermann Oberth" Faculty of Enginereeing, Department of Computers Sciences. A Web based application has been developed in order to enable students to self-evaluate their metacognitive competencies and to acquire self-regulatory abilities.

Efficient estimation of tuned liquid column damper inerter (TLCDI) parameters for seismic control of base‐isolated structures

2022

This paper presents an enhanced base-isolation (BI) system equipped with a novel passive control device composed of a tuned liquid damper and an inerter (TLCDI). With the aim of reducing the seismic response of BI systems, this contribution focuses on the design of the TLCDI providing analytical solutions for the optimal TLCDI parameters, easily implementable in the design phase. The effectiveness of the proposed approach in terms of seismic response reduction and computational gain is validated by comparison with classical numerical optimization techniques. The control performance of two different base-isolated TLCDI-controlled structures is assessed by employing real-ground motion records…

How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions?

2012

It has long been known that any Boolean function that depends on n input variables has both degree and exact quantum query complexity of Omega(log n), and that this bound is achieved for some functions. In this paper we study the case of approximate degree and bounded-error quantum query complexity. We show that for these measures the correct lower bound is Omega(log n / loglog n), and we exhibit quantum algorithms for two functions where this bound is achieved.

Comparison of implementations of the lattice-Boltzmann method

2008

AbstractSimplicity of coding is usually an appealing feature of the lattice-Boltzmann method (LBM). Conventional implementations of LBM are often based on the two-lattice or the two-step algorithm, which however suffer from high memory consumption and poor computational performance, respectively. The aim of this work was to identify implementations of LBM that would achieve high computational performance with low memory consumption. Effects of memory addressing schemes were investigated in particular. Data layouts for velocity distribution values were also considered, and they were found to be related to computational performance. A novel bundle data layout was therefore introduced. Address…

[Editorial] Special issue on computational intelligence and nature-inspired algorithms for real-world data analytics and pattern recognition

2018

Cagnoni, S., & Castelli, M. (2018). [Editorial]. Special issue on computational intelligence and nature-inspired algorithms for real-world data analytics and pattern recognition. Algorithms, 11(3), 1-2. DOI: 10.3390/a11030025 This special issue of Algorithms is devoted to the study of Computational Intelligence and Nature-Inspired Algorithms for Real-World Data Analytics and Pattern Recognition. The special issue considered both theoretical contributions able to advance the state-of-the-art in this field and practical applications that describe novel approaches for solving real-world problems. published

Shuttling-Based Trapped-Ion Quantum Information Processing

2020

Moving trapped-ion qubits in a microstructured array of radiofrequency traps offers a route toward realizing scalable quantum processing nodes. Establishing such nodes, providing sufficient functionality to represent a building block for emerging quantum technologies, e.g., a quantum computer or quantum repeater, remains a formidable technological challenge. In this review, the authors present a holistic view on such an architecture, including the relevant components, their characterization, and their impact on the overall system performance. The authors present a hardware architecture based on a uniform linear segmented multilayer trap, controlled by a custom-made fast multichannel arbitra…

Robust entanglement preparation against noise by controlling spatial indistinguishability

2019

Initialization of composite quantum systems into highly entangled states is usually a must to allow their use for quantum technologies. However, the presence of unavoidable noise in the preparation stage makes the system state mixed, thus limiting the possibility of achieving this goal. Here we address this problem in the context of identical particle systems. We define the entanglement of formation for an arbitrary state of two identical qubits within the operational framework of spatially localized operations and classical communication (sLOCC). We then introduce an entropic measure of spatial indistinguishability under sLOCC as an information resource. We show that spatial indistinguisha…

Energy-efficient quantum computing

2016

In the near future, a major challenge in quantum computing is to scale up robust qubit prototypes to practical problem sizes and to implement comprehensive error correction for computational precision. Due to inevitable quantum uncertainties in resonant control pulses, increasing the precision of quantum gates comes with the expense of increased energy consumption. Consequently, the power dissipated in the vicinity of the processor in a well-working large-scale quantum computer seems unacceptably large in typical systems requiring low operation temperatures. Here, we introduce a method for qubit driving and show that it serves to decrease the single-qubit gate error without increasing the a…

Secure random number generation in wireless sensor networks

2014

The increasing adoption of wireless sensor networks as a flexible and inexpensive tool for the most diverse applications, ranging from environmental monitoring to home automation, has raised more and more attention to the issues related to the design of specifically customized security mechanisms. The scarcity of computational, storage, and bandwidth resources cannot definitely be disregarded in such context, and this makes the implementation of security algorithms particularly challenging. This paper proposes a security framework for the generation of true random numbers, which are paramount as the core building block for many security algorithms; the intrinsic nature of wireless sensor no…